/*
*  Copyright (c) 2001 Sun Microsystems, Inc.  All rights
*  reserved.
*
*  Redistribution and use in source and binary forms, with or without
*  modification, are permitted provided that the following conditions
*  are met:
*
*  1. Redistributions of source code must retain the above copyright
*  notice, this list of conditions and the following disclaimer.
*
*  2. Redistributions in binary form must reproduce the above copyright
*  notice, this list of conditions and the following disclaimer in
*  the documentation and/or other materials provided with the
*  distribution.
*
*  3. The end-user documentation included with the redistribution,
*  if any, must include the following acknowledgment:
*  "This product includes software developed by the
*  Sun Microsystems, Inc. for Project JXTA."
*  Alternately, this acknowledgment may appear in the software itself,
*  if and wherever such third-party acknowledgments normally appear.
*
*  4. The names "Sun", "Sun Microsystems, Inc.", "JXTA" and "Project JXTA"
*  must not be used to endorse or promote products derived from this
*  software without prior written permission. For written
*  permission, please contact Project JXTA at http://www.jxta.org.
*
*  5. Products derived from this software may not be called "JXTA",
*  nor may "JXTA" appear in their name, without prior written
*  permission of Sun.
*
*  THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
*  WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
*  OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
*  DISCLAIMED.  IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
*  ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
*  SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
*  LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
*  USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
*  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
*  OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
*  OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
*  SUCH DAMAGE.
*  ====================================================================
*
*  This software consists of voluntary contributions made by many
*  individuals on behalf of Project JXTA.  For more
*  information on Project JXTA, please see
*  <http://www.jxta.org/>.
*
*  This license is based on the BSD license adopted by the Apache Foundation.
*
*  $Id: ShareSearch.java,v 1.4 2006/05/17 21:02:46 nano Exp $
*/

package net.jxta.myjxta.search;

import net.jxta.myjxta.MyJXTA;
import net.jxta.myjxta.util.Group;
import net.jxta.myjxta.util.Share;
import net.jxta.myjxta.util.objectmodel.ShareNode;
import net.jxta.share.ContentAdvertisement;
import net.jxta.share.client.ListContentRequest;

/**
 *
 * @version $Id: ShareSearch.java,v 1.4 2006/05/17 21:02:46 nano Exp $
 *
 * @author james todd [gonzo at jxta dot org]
 */

public class ShareSearch
    extends AbstractSearch {

    private static final String TITLE = "Share Search";
    private static final String DESCRIPTION = "shares";

    private ListContentRequest requestor = null;

    public ShareSearch(Group group,MyJXTA myJxta) {
        super(group, myJxta);

        setTitle(TITLE);
    }

    public String getSearchDescription() {
        return getDescription(DESCRIPTION);
    }

    public void search(String term) {
        setTerm(term);

        String criteria = (term.trim().length() == 0 ||
                           term.trim().equals(WILDCARD) ? null : term);
        cancel();
        isRunning(true);

        this.requestor =
            new ListContentRequest(getGroup().getPeerGroup(), criteria) {
                public void notifyMoreResults() {
                    process(getResults());
                }
            };
        requestor.activateRequest();

        isRunning(false);
    }

    public void cancel() {
        if (isRunning()) {
            isRunning(false);

            if (this.requestor != null) {
                this.requestor.cancel();
            }

            super.cancel();
        }
    }

    private void process(ContentAdvertisement[] ca) {
        for (int i = 0; ca != null && i < ca.length; i++) {
            add(new ShareNode(new Share(ca[i]), group, ShareNode.REMOTE_SHARE));
        }
    }
}
